(A-)synchronous (non-)deterministic cell spaces simulating each other
نویسندگان
چکیده
منابع مشابه
Compositional Semantics of Non-Deterministic Synchronous Languages
A key feature of synchronous languages is that they conciliate con-currency with determinism. This is achieved by detecting so-called causality errors BG92, HM95, STB95], which occur when the composition of deterministic processes is not deterministic. Although the existing synchronous languages only deal with deterministic programs, it is not a restriction of the approach. We show how a synchr...
متن کاملProtocols for Non-Deterministic Communication over Synchronous Channels
In this paper, we propose several deadlock-free protocols for implementing the generalized alternative construct, where a process non-deterministically chooses between sending or receiving among various synchronous channels. We consider general many-to-many channels and examine in detail the special case of fan (many-toone and one-to-many) channels, which are common and can be implemented much ...
متن کاملPeriodic Remapping of Non-Deterministic Bulk Synchronous Computations
Dynamic remapping is critical to the performance of bulk synchronous computations that have non-deterministic behaviors because of the need of barrier synchronization between phases. This paper presents a formal analysis of the issue of when to remap for dynamic computations with a priori known statistical behaviors, with an objective of finding optimal remapping frequencies for a given toleran...
متن کاملAdaptive Protocols for Negotiating Non-Deterministic Choice over Synchronous Channels
In this paper, we propose several deadlock-free protocols for implementing the generalized alternative construct, where a process non-deterministically chooses between sending or receiving among various synchronous channels. We consider general many-to-many channels and examine in detail the special case of fan (many-to-one and one-to-many) channels, which are common and can be implemented much...
متن کاملSimulating Synchronous Processors
In this paper we show how a distributed system with synchronous processors and asynchronous message delays can be simulated by a system with both asvn chronous processors arid asynchronous rnessa.e delays in the presence of vañous types of processor faults. Consequently, the result of Fischer, Lynch and Paterson (1985), that no consensus protocol for asynchronous processors and communication ca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1978
ISSN: 0022-0000
DOI: 10.1016/0022-0000(78)90003-x